When are Two Rewrite Systems More than None?
نویسنده
چکیده
It is important for programs to have modular correctness properties. We look at non-deterministic programs expressed as termrewriting systems (which compute normal forms of input terms) and consider the case where individual systems share constructors, but not de ned symbols. We present some old and new su cient conditions under which termination (existence of normal forms, regardless of computation strategy) and con uence (uniqueness) are preserved by such combinations.
منابع مشابه
On Termination of One Rule Rewrite Systems
The undecidability of the termination of rewrite systems is usually proved by reduction to the halting of Turing machines. In particular, Dauchet proves the unde-cidability of the termination of one rule rewrite systems by coding Turing machines into one rule rewrite systems. Rewrite systems are a very simple model of computation and one may expect proofs in this model to be more straightforwar...
متن کاملOn the Modularity of Deciding Call-by-Need
In a recent paper we introduced a new framework for the study of call by need computations. Using elementary tree automata techniques and ground tree transducers we obtained simple decidability proofs for a hierarchy of classes of rewrite systems that are much larger than earlier classes defined using the complicated sequentiality concept. In this paper we study the modularity of membership in ...
متن کاملTransforming Context - Sensitive RewriteSystemsJ
We present two new transformation techniques for proving termination of context-sensitive rewriting. Our rst method is simple, sound, and more powerful than previously suggested transformations. However, it is not complete, i.e., there are terminating context-sensitive rewrite systems that are transformed into non-terminating term rewrite systems. The second method that we present in this paper...
متن کاملTransforming Context-Sensitive Rewrite Systems
We present two new transformation techniques for proving termination of context-sensitive rewriting. Our rst method is simple, sound, and more powerful than previously suggested transformations. However, it is not complete, i.e., there are terminating context-sensitive rewrite systems that are transformed into non-terminating term rewrite systems. The second method that we present in this paper...
متن کاملTransformation techniques for context-sensitive rewrite systems
Context-sensitive rewriting is a computational restriction of term rewriting used to model non-strict (lazy) evaluation in functional programming. The goal of this paper is the study and development of techniques to analyze the termination behavior of context-sensitive rewrite systems. For that purpose, several methods have been proposed in the literature which transform contextsensitive rewrit...
متن کامل